A modular inherently nonfinitely based lattice

نویسندگان

  • Ralph Freese
  • George McNulty
  • Walter Taylor
چکیده

Proof. As observed in McNulty [7], a locally finite variety V of finite type is inherently nonfinitely based if and only if for infinitely many natural numbers N , there is a non-locally-finite algebra each of whose N -generated subalgebras belongs to V. We prove the theorem by establishing these facts. We assume the reader is familiar with the basic facts of modular lattices; see [1], [2], [6]. Let B (for bottom) be the sublattice of L∞ consisting of all elements of finite height and let T consist of all elements of finite depth. Of course L∞ is the ordinal (or linear) sum B + T of these sublattices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inherently nonfinitely based lattices

We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) generated by L is locally finite and that L belongs to no locally finite finitely axiomatizable equational class. We also provide an example of a lattice which fails to be inherently nonfinitely based but whose equational th...

متن کامل

Inherently Nonfinitely Based Solvable Algebras

We prove that an inherently nonfinitely based algebra cannot generate an abelian variety. On the other hand, we show by example that it is possible for an inherently nonfinitely based algebra to generate a strongly solvable variety.

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

On the Finite Basis Problem for the Monoids of Triangular Boolean Matrices

Let T Bn denote the submonoid of all upper triangular boolean n×n matrices. It is shown by Volkov and Goldberg [6] that T Bn is nonfinitely based if n > 3, but the cases when n = 2, 3 remained open. In this paper, it is shown that the monoid T B2 is finitely based and a finite identity basis for the monoid T B2 is given. Moreover, it is shown that T B3 is inherently nonfinitely based. Hence T B...

متن کامل

Solution to the Chautauqua Problem

There exists an infinite ascending chain of finitely generated clones on a nine-element set for which the corresponding algebras are alternately finitely based and inherently nonfinitely based. In 1981, at the Chautauqua resort near Boulder, Colorado, in the presence of a large walnut salad, G. McNulty posed the following problem (published in [5, p. 227]): Problem. Let A be a finite set with a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004